//二维前缀和模板
/*
连接：https://www.nowcoder.com/practice/99eb8040d116414ea3296467ce81cbbc?tpId=230&tqId=2023819&ru=/exam/oj&qru=/ta/dynamic-programming/question-ranking&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E7%25AE%2597%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D196

题目：

1、预处理前缀和矩阵
    dp[i][j] 表示从[1][1]到[i][j]位置这段区间里面所有元素的和（以1，1到i，j作为对角线括起来的矩形中的元素和）
*/

#include <iostream>
#include<vector>
using namespace std;

int main() {
    int n,m,q;
    cin>>n>>m>>q;
    vector<vector<int>> nums(n+1,vector<int>(m+1));
    for(int i =1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            cin>>nums[i][j];
        }
    }
    vector<vector<long long>> dp(n+1,vector<long long>(m+1));
    for(int i =1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            dp[i][j] = dp[i][j-1]+dp[i-1][j]-dp[i-1][j-1]+nums[i][j];
        }
    }
    int x1,y1,x2,y2;
    while(q--)
    {
        cin>>x1>>y1>>x2>>y2;
        cout<<dp[x2][y2]-dp[x2][y1-1]-dp[x1-1][y2]+dp[x1-1][y1-1]<<endl;
    }

}